Maximally non-hamiltonian graphs of girth 7
نویسنده
چکیده
We describe a sufficient condition for graphs used in a construction of Thomassen (which yields hypohamiltonian graphs) to produce maximally non-hamiltonian (MNH) graphs as well. Then we show that the Coxeter graph fulfils this sufficient condition, and thus applying the Thomassen’s construction to multiple copies of the Coxeter graph yields infinitely many MNH graphs with girth 7. So far, the Coxeter graph was the only known example of a MNH graph of girth 7; also no MNH graph of girth greater than 7 has been found yet. Finally, the Isaacs’ flower snarks Jk for odd k ≥ 5 are shown to fulfil (for certain vertices) this sufficient condition as well.
منابع مشابه
Structural and computational results on platypus graphs
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance hypohamiltonian, leaf-stable, and maximally non-hamiltonian graphs. In this paper, we first investigate cubic platypus graphs, covering all orders for which such...
متن کاملNon-Hamiltonian 3–Regular Graphs with Arbitrary Girth
It is well known that 3–regular graphs with arbitrarily large girth exist. Three constructions are given that use the former to produce non-Hamiltonian 3–regular graphs without reducing the girth, thereby proving that such graphs with arbitrarily large girth also exist. The resulting graphs can be 1–, 2– or 3–edge-connected depending on the construction chosen. From the constructions arise (nai...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملNew results on hypohamiltonian and almost hypohamiltonian graphs
Consider a non-hamiltonian graph G. G is hypohamiltonian if for every vertex v in G, the graph G − v is hamiltonian. G is almost hypohamiltonian if there exists a vertex w in G such that G−w is non-hamiltonian, and G− v is hamiltonian for every vertex v 6= w. McKay asked in [J. Graph Theory, doi: 10.1002/jgt.22043] whether infinitely many planar cubic hypohamiltonian graphs of girth 5 exist. We...
متن کاملNon-Isomorphic Smallest Maximally Non-Hamiltonian Graphs
A graph G is maximally non-hamiltonian (MNH) if G is not hamiltonian but becomes hamiltonian after adding an arbitrary new edge. Bondy 2] showed that the smallest size (= number of edges) in a MNH graph of order n is at least d 3n 2 e for n 7. The fact that equality may hold there for innnitely many n was suggested by Bollobbs 1]. This was connrmed by Clark, Entringer and Shapiro (see 5, 6]) an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 12 شماره
صفحات -
تاریخ انتشار 1996